Quaternary Fixed-Polarity Reed-Muller expansion computation through operations on disjoint cubes and its comparison with other methods
نویسندگان
چکیده
A new algorithm for calculating quaternary Fixed-Polarity Reed–Muller (FPRM) spectra is described in this paper. The presented algorithm directly converts array of disjoint cubes representation of a quaternary function into its FPRM spectral coefficients. The main advantage of this algorithm is that it requires less memory space than other algorithms. Since each spectral coefficient can be calculated independently of other spectral coefficients, the algorithm can be implemented using parallel programming. Brief reviews and experimental results of several existing algorithms for the calculation of quaternary FPRM spectra are also included in this paper together with experimental results of the new algorithm for comparison purpose. 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
On the Calculation of Generalized Reed-muller Canonical Expansions from Disjoint Cube Representation of Boolean Functions
A new algorithm is shown that converts disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm Ihal generates the GRME based on the factorization or thc Reed-Muller transform matrix always starts from the truth table (minterms) of Boolean function, then the described method has the advantages due to smaller ...
متن کاملOptimization of Fixed-polarity Reed-muller Circuits Using Dual-polarity Property*
In the optimization of canonical Reed-Muller (RM) circuits, RM polynomials with different polarities are usually derived directly from Boolean expressions. Time efficiency is thus not fully achieved because the information in finding RM expansion of one polarity is not utilized by others. We show in this paper that two fixed-polarity RM expansions that have the same number of variables and whos...
متن کاملGeneration of multi-polarity helix transform over GF(3)
In this article, the new multi-polarity helix transform for ternary logic functions has been introduced. In addition, an extended dual polarity property that had been used to optimize Kronecker and quaternary Fixed-Polarity Reed-Muller (FPRM) expressions has been applied to generate efficiently the multi-polarity helix transform over GF(3). The experimental results for the transform are compare...
متن کاملEfficient Calculation of Fixed-Polarity Polynomial Expressions for Multiple-Valued Logic Functions
This paper presents a tabular technique for calculation of fixed-polarity polynomial expressions for MV functions. The technique is derived from a generalization of the corresponding methods for Fixed-Polarity Reed-Muller (FPRM) expressions for switching functions. All useful features of tabular techniques for FPRMs, as for example, simplicity of involved operations and high possibilities for p...
متن کاملCalculation of best fixed polarity Reed-Muller transform over GF(5)
In this article, a new algorithm that takes the truth vector of a 5-valued function as its input and proceeds to generate all of the function’s fixed polarity Reed-Muller (FPRM) spectral coefficient vectors one by one in a certain sequence is presented. The experimental results for this algorithm are compared with other methods and it was found that it is more efficient than other methods for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Electrical Engineering
دوره 31 شماره
صفحات -
تاریخ انتشار 2005